Mechanism Design via Dantzig-Wolfe Decomposition
نویسنده
چکیده
In random allocation rules, typically first an optimal fractional point is calculated via solving a linear program. Lying in the feasible region of the linear program, the fractional point satisfies the underlying constraints. In effect, the point represents a fractional assignment of objects or more generally packages of objects to agents. In order to implement an expected assignment, one must decompose the point into integer solutions, each satisfying underlying constraints. The resulting convex combination can then be viewed as a probability distribution over feasible assignments out of which a random assignment can be sampled. This approach has been successfully employed in combinatorial optimization [1] as well as mechanism design with or without money [2–4]. In this paper, we show that both finding the optimal fractional point as well as its decomposition into integer solutions can be done at once. We propose an appropriate linear program which provides the desired solution. We show that the linear program can be solved via DantzigWolfe decomposition. The resulting convex decomposition is tight in terms of the number of integer points according to Carathéodory theorem. Dantzig-Wolfe decomposition is a direct implementation of the revised simplex method which is well known to be highly efficient in practice. The method can also find a decomposition into integer solutions when the fractional point is readily present perhaps as an outcome of other algorithms rather than linear programming.
منابع مشابه
A stabilized structured Dantzig-Wolfe decomposition method
We present an algorithmic scheme, which we call the Structured Dantzig-Wolfe decomposition method, that can be used for solving large-scale structured Linear Programs (LPs). The required structure of the LPs is the same as in the original DantzigWolfe approach, that is, a polyhedron over which optimization is “easy” plus a set of “complicating” constraints. Under the hypothesis that an alternat...
متن کاملDantzig-wolfe Decomposition with Gams
This document illustrates the Dantzig-Wolfe decomposition algorithm using GAMS.
متن کاملInterior Point Methods with Decomposition for Solving Large Scale Linear Programs
This paper deals with an algorithm incorporating the interior point method into the Dantzig-Wolfe decomposition technique for solving large-scale linear programming problems. The algorithm decomposes a linear program into a main problem and a subprob-lem. The subproblem is solved approximately. Hence, inexact Newton directions are used in solving the main problem. We show that the algorithm is ...
متن کاملMassively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling
Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. In this paper, Dantzig-Wolfe decomposition is applied to a linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1508.04250 شماره
صفحات -
تاریخ انتشار 2015